Advanced electrostatic ion thruster for space propulsion

The suitability of the baseline 30 cm thruster for future space missions was examined. Preliminary design concepts for several advanced thrusters were developed to assess the potential practical difficulties of a new design. Useful methodologies were produced for assessing both planetary and earth orbit missions. Payload performance as a function of propulsion system technology level and cost sensitivity to propulsion system technology level are among the topics assessed. A 50 cm diameter thruster designed to operate with a beam voltage of about 2400 V is suggested to satisfy most of the requirements of future space missions

Aerothermodynamic Assessment of Corrugated Panel Thermal Protection Systems

The feasibility of using corrugated panels as a thermal protection system for an advanced space transportation vehicle was investigated. The study consisted of two major tasks: development of improved correlations for wind tunnel heat transfer and pressure data to yield design techniques, and application of the design techniques to determine if corrugated panels have application future aerospace vehicles. A single-stage-to-orbit vehicle was used to assess advantages and aerothermodynamic penalties associated with use of such panels. In the correlation task, experimental turbulent heat transfer and pressure data obtained on corrugation roughened surfaces during wind tunnel testing were analyzed and compared with flat plate data. The correlations and data comparisons included the effects of a large range of geometric, inviscid flow, internal boundary layer, and bulk boundary layer parameters in supersonic and hypersonic flow

Improved Algorithms for Approximate String Matching (Extended Abstract)

The problem of approximate string matching is important in many different areas such as computational biology, text processing and pattern recognition. A great effort has been made to design efficient algorithms addressing several variants of the problem, including comparison of two strings, approximate pattern identification in a string or calculation of the longest common subsequence that two strings share. We designed an output sensitive algorithm solving the edit distance problem between two strings of lengths n and m respectively in time O((s-|n-m|)min(m,n,s)+m+n) and linear space, where s is the edit distance between the two strings. This worst-case time bound sets the quadratic factor of the algorithm independent of the longest string length and improves existing theoretical bounds for this problem. The implementation of our algorithm excels also in practice, especially in cases where the two strings compared differ significantly in length. Source code of our algorithm is available at http://www.cs.miami.edu/\~dimitris/edit_distanceComment: 10 page

Fast Searching in Packed Strings

Given strings $P$ and $Q$ the (exact) string matching problem is to find all positions of substrings in $Q$ matching $P$. The classical Knuth-Morris-Pratt algorithm [SIAM J. Comput., 1977] solves the string matching problem in linear time which is optimal if we can only read one character at the time. However, most strings are stored in a computer in a packed representation with several characters in a single word, giving us the opportunity to read multiple characters simultaneously. In this paper we study the worst-case complexity of string matching on strings given in packed representation. Let $m \leq n$ be the lengths $P$ and $Q$, respectively, and let $\sigma$ denote the size of the alphabet. On a standard unit-cost word-RAM with logarithmic word size we present an algorithm using time O\left(\frac{n}{\log_\sigma n} + m + \occ\right). Here \occ is the number of occurrences of $P$ in $Q$. For $m = o(n)$ this improves the $O(n)$ bound of the Knuth-Morris-Pratt algorithm. Furthermore, if $m = O(n/\log_\sigma n)$ our algorithm is optimal since any algorithm must spend at least \Omega(\frac{(n+m)\log \sigma}{\log n} + \occ) = \Omega(\frac{n}{\log_\sigma n} + \occ) time to read the input and report all occurrences. The result is obtained by a novel automaton construction based on the Knuth-Morris-Pratt algorithm combined with a new compact representation of subautomata allowing an optimal tabulation-based simulation.Comment: To appear in Journal of Discrete Algorithms. Special Issue on CPM 200

Faster subsequence recognition in compressed strings

Computation on compressed strings is one of the key approaches to processing massive data sets. We consider local subsequence recognition problems on strings compressed by straight-line programs (SLP), which is closely related to Lempel--Ziv compression. For an SLP-compressed text of length $\bar m$, and an uncompressed pattern of length $n$, C{\'e}gielski et al. gave an algorithm for local subsequence recognition running in time $O(\bar mn^2 \log n)$. We improve the running time to $O(\bar mn^{1.5})$. Our algorithm can also be used to compute the longest common subsequence between a compressed text and an uncompressed pattern in time $O(\bar mn^{1.5})$; the same problem with a compressed pattern is known to be NP-hard

Conductance Increase by Electron-Phonon Interaction in Quantum Wires

We investigate the influence of electron-phonon interactions on the DC-conductance $\Gamma$ of a quantum wire in the limit of one occupied subband. At zero temperature, a Tomonaga-Luttinger-like renormalization of $\Gamma$ to a value slightly larger than $2e^{2}/h$ is calculated for a realistic quantum wire model.Comment: 12 pages RevTeX, no figure. Appears in Phys. Rev.